Membership Conditional Term Rewriting Systems
نویسنده
چکیده
We propose a new type of conditional term rewriting system: the membership-conditional term rewriting system, in which, each rewriting rule can have membership conditions which restrict the substitution values for the variables occurring in the rule. For example, the rule f(x, x, y) . g(x, y) if x ∈ T ′ yields the reduction f(M, M, N) → g(M, N) only when M is in the term set T ′. We study the confluence of membership-conditional term rewriting systems that are nonterminating and nonlinear. It is shown that a restricted nonlinear term rewriting system in which membership conditions satisfy the closure and termination properties is confluent if the system is nonoverlapping.
منابع مشابه
Call-by-need reduction for membership conditional term rewriting Systems
This paper proves that, for a normal membership conditional term rewriting system (MCTRS), (1) a reducible term has a needed redex if the MCTRS is nonoverlapping, and (2) whether a redex is nv-needed is decidable.
متن کاملConfluent Term Rewriting Systems with Membership Conditions
1. I n t r o d u c t i o n Many term rewriting systems and their modifications are considered in logic, automated theorem proving, and programming language [2,3,4,6,8,9]. A fundamental property of term rewriting systems is the confluence property. A few sufficient criteria for the confluence are well known [2,3,4,5,8,9]. However, if a term rewriting system is nonterminating and nonlinear, we kn...
متن کاملTransformation for Refining Unraveled Conditional Term Rewriting Systems
Unravelings, which transform conditional term rewriting systems (CTRSs) into unconditional term rewriting systems, are useful for analyzing properties of CTRSs. To compute reduction sequences of CTRSs, the restriction by a particular context-sensitive and membership condition is imposed on reductions of the unraveled CTRSs. The condition is determined by extra function symbols introduced due to...
متن کاملSound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems
In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Şerbănuţă and Roşu, is a sound structure-preserving transformation for weakly-left-linear deterministic conditional term rewriting systems. More precisely, we show that every weakly-leftlinear deterministic conditional term rewriting system can be converted to an equivalent weakly-leftline...
متن کاملConfluence of Conditional Term Rewrite Systems via Transformations
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite systems. Recent results provide confluence criteria for conditional term rewrite systems via transformations, yet they are restricted to CTRSs with ...
متن کامل